A fast iterative algorithm for high-dimensional differential network
نویسندگان
چکیده
منابع مشابه
A Fast Iterative Algorithm for Elliptic Interfaceproblemsrevised
A fast, second order accurate iterative method is proposed for the elliptic equation r ((x;y)ru) = f(x;y) in a rectangular region in 2 space dimensions. We assume that there is an irregular interface across which the coeecient , the solution u and its derivatives, and/or the source term f may have jumps. We are especially interested in the cases where the coeecients are piecewise constant and t...
متن کاملA Fast Algorithm for high-dimensional Similarity Joins
Many emerging data mining applications require a similarity join between points in a highdimensional domain. We present a new algorithm that utilizes a new index structure, called the -kdB tree, for fast spatial similarity joins on high-dimensional points. This index structure reduces the number of neighboring leaf nodes that are considered for the join test, as well as the traversal cost of nd...
متن کاملA Fast Shadowing Algorithm for High-Dimensional ODE Systems
Numerical solutions to chaotic dynamical systems are suspect because the chaotic nature of the problem implies that numerical errors are magnified exponentially with time. To bolster confidence in the reliability of such solutions, we turn to the study of shadowing. An exact trajectory of a chaotic dynamical system lying near an approximate trajectory is called a shadow. Finding shadows of nume...
متن کاملAn Iterative Algorithm for Fast Iris Detection
Reliable detection of irises is a necessary precondition for any iris-based biometric identification system. It is also important in measuring the movement of eyes in applications such as alertness detection and eye-guided user interfaces. This paper introduces a novel iterative algorithm for the accurate and fast localization of irises in eye images.
متن کاملA Fast Hierarchical Non-Iterative Registration Algorithm
This note describes a fast algorithm for registering pairs of images from a time sequence of images. The algorithm solves a linear regression problem based on a linearization of the image matching equation, in order to obtain the registration coefficients. The problem of ill-posedness caused by differentiation of a noisy image sampled on a finite lattice is solved by means of a 'patch algorithm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Statistics
سال: 2019
ISSN: 0943-4062,1613-9658
DOI: 10.1007/s00180-019-00915-w